Set-theoretical models of λ-calculus: theories, expansions, isomorphisms
نویسندگان
چکیده
منابع مشابه
Set - Theoretical Models of a - Calculus : Theories , Expansions , Isomorphisms *
This paper mainly deals with the models for type free h-calculus defined by Plotkin [IS], Engeler [12] and Scott [22]. (See also [9] for a similar construction.) Plotkin-Scott-Algebras (PSE-Algebras, in view of Engeler’s approach) are built up in a very natural set theoretic way and provide a generalization of early ideas in Scott [20,21]. Namely, the notion of application (interpreting formal ...
متن کاملModels and theories of λ-calculus
In this paper we briefly summarize the contents of Manzonetto’s PhD thesis [35] which concerns denotational semantics and equational/order theories of the pure untyped λ-calculus. The main research achievements include: (i) a general construction of λ-models from reflexive objects in (possibly non-well-pointed) categories; (ii) a Stonestyle representation theorem for combinatory algebras; (iii)...
متن کاملSet-Theoretical and Other Elementary Models of the lambda-Calculus
Part 1 of this paper is the previously unpublished 1972 memorandum [43], with editorial changes and some minor corrections. Part 2 presents what happened next, together with some further development of the material. The rst part begins with an elementary set-theoretical model of the -calculus. Functions are modeled in a similar way to that normally employed in set theory, by their graphs; di cu...
متن کاملEffective λ-models versus recursively enumerable λ-theories
A longstanding open problem is whether there exists a non-syntactical model of the untyped λ-calculus whose theory is exactly the least λ-theory λβ . In this paper we investigate the more general question of whether the equational/order theory of a model of the untyped λ-calculus can be recursively enumerable (r.e. for brevity). We introduce a notion of effective model of λ-calculus, which cove...
متن کاملLambda Calculus: Models and Theories
In this paper we give an outline of recent results concerning theories and models of the untyped lambda calculus. Algebraic and topological methods have been applied to study the structure of the lattice of λ-theories, the equational incompleteness of lambda calculus semantics, and the λ-theories induced by graph models of lambda calculus.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1983
ISSN: 0168-0072
DOI: 10.1016/0168-0072(83)90030-1